On the (non-)cumulativity of cumulative quantifiers
نویسنده
چکیده
This paper investigates some differences between partitive and non-partitive count quantifiers with respect to their ability to participate in cumulative readings and their compatibility with collectively interpreted mixed main predicates. An analysis of quantification is adopted in which a quantifier takes an individual as its first argument. The type of this individual argument together with some independent assumptions is argued to be responsible for the observed data. The analysis is subsequently expanded to a related set of facts concerning partitive and non-partitive mass quantifiers: their (in)compatibility with non-homogeneous main predicates.
منابع مشابه
First Steps Towards Cumulative Inductive Types in CIC
We discuss our on-going research on making inductive types cumulative in the predicative calculus of inductive constructions (pCIC) – the logic of the Coq proof assistant. Having inductive types be cumulative alleviates some problems that occur while working with large inductive types, e.g., the category of small categories, in pCIC. We present the pCuIC system which adds cumulativity for induc...
متن کاملTwo Cumulativity Results on J-and Pj-default Logics
This paper reports two cumulativity results for J-and PJ-default logics formalized by Del-grande and Jackson Delgrande and Jackson, 1991] in the context of skeptical reasoning: (1) PJ-default logic is cumulative, and (2) J-default logic is not cumulative in general but there is a nontrivial class of theories for which the cumu-lativity property can still hold. We also investigate semantical imp...
متن کاملTowards a Uniform Strategy of Plural Quantiication? Iterative Cumulativity and the Witness Condition
This paper relates to the question whether there is a uniform method of collective quantiication. Several approaches to plural quantiication are presented as a background for Winter's (1998) uniied df it lifting strategy. The main proposal is that so-called cumulative readings, which are known to be non-iterative, are in fact deriv-able, under certain circumstances, by an iterative procedure. C...
متن کاملFrench schwa and gradient cumulativity
We model the interaction of two phonological factors that condition French schwa alternations: schwa is more likely after two consonants; and schwa is more likely in the penultimate syllable. Using new data from a judgment study, we show that both factors play a role in schwa epenthesis and deletion, confirming previous impressionistic descriptions, and that the two factors interact cumulativel...
متن کاملA Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties
Our aim in this article is to present a method for classifying and characterizing the various different semantics of logic programs with negation that have been considered in the last years. Instead of appealing to more or less questionable intuitions, we take a more structural view: our starting point is the observation that all semantics induce in a natural way non-monotonic entailment relati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010